A ground-complete axiomatization of finite-state processes in generic process algebra
نویسنده
چکیده
The three classical process algebras CCS, CSP and ACP present several differences in their respective technical machinery. This is due, not only to the difference in their operators, but also to the terminology and “way of thinking” of the community which has been (and still is) working with them. In this paper we will first discuss such differences and try to clarify the different usage of terminology and concepts. Then, as a result of this discussion, we define a generic process algebra where each basic mechanism of the three process algebras (including minimal fixpoint based unguarded recursion) is expressed by an operator and which can be used as an underlying common language. We show an example of the advantages of adopting such a language instead of one of the three more specialized algebras: producing a complete axiomatization for Milner‘s observational congruence in the presence of (unguarded) recursion and static operators. More precisely, we provide a syntactical characterization (allowing as many terms as possible) for the equations involved in recursion operators, which guarantees that transition systems generated by the operational semantics are finite-state. Vice-versa we show that every process admits a specification in terms of such a restricted form of recursion. We then present an axiomatization which is ground-complete over such a restricted signature. Notably, we also show that the two standard axioms of Milner for weakly unguarded recursion can be expressed by using just a single axiom.
منابع مشابه
A Ground-Complete Axiomatization of Finite-State Processes in a Generic Process Algebra
The three classical process algebras CCS, CSP and ACP present several differences in their respective technical machinery. This is due, not only to the difference in their operators, but also to the terminology and “way of thinking” of the community which has been (and still is) working with them. In this paper we will first discuss such differences and try to clarify the different usage of ter...
متن کاملA ground-complete axiomatisation of finite-state processes in a generic process algebra
The three classical process algebras CCS, CSP and ACP present several differences in their respective technical machinery. This is due, not only to the difference in their operators, but also to the terminology and “way of thinking” of the community which has been (and still is) working with them. In this paper we will first discuss such differences and try to clarify the different usage of ter...
متن کاملOn the Axiomatizability of Impossible Futures
A general method is established to derive a ground-complete axiomatization for a weak semantics from such an axiomatization for its concrete counterpart, in the context of the process algebra BCCS. This transformation moreover preserves ω-completeness. It is applicable to semantics at least as coarse as impossible futures semantics. As an application, groundand ω-complete axiomatizations are de...
متن کاملOn the Axiomatizability of Priority
This paper studies the equational theory of bisimulation equivalence over the process algebra BCCSP extended with the priority operator of Baeten, Bergstra and Klop. It is proven that, in the presence of an infinite set of actions, bisimulation equivalence has no finite, sound, ground-complete equational axiomatization over that language. This negative result applies even if the syntax is exten...
متن کاملReady to Preorder: Get Your BCCSP Axiomatization for Free!
This paper contributes to the study of the equational theory of the semantics in van Glabbeek’s linear time branching time spectrum over the language BCCSP, a basic process algebra for the description of finite synchronization trees. It offers an algorithm for producing a complete (respectively, ground-complete) equational axiomatization of any behavioral congruence lying between ready simulati...
متن کامل